Two infinite hierarchies of languages defined by branching grammars
نویسنده
چکیده
Two types of branching grammars are introduced inspired from Havel's works about branching automata. They naturally define two infinite hierarchies into the family of regular, respectively, linear languages. Homomorphic characterisations of regular and linear languages >n terms of branching languages are obtained. Finally, the relations between branching grammars and contextual grammars of [5] are investigated.
منابع مشابه
On Internal Contextual Grammars with Subregular Selection Languages
In this paper, we study the power of internal contextual grammars with selection languages from subfamilies of the family of regular languages. If we consider families Fn which are obtained by restriction to n states or nonterminals or productions or symbols to accept or to generate regular languages, we obtain four infinite hierarchies of the corresponding families of languages generated by in...
متن کاملSelf-Regulating Finite Automata
This paper introduces and discusses self-regulating finite automata. In essence, these automata regulate the use of their rules by a sequence of rules applied during previous moves. A special attention is paid to turns defined as moves during which a self-regulating finite automaton starts a new self-regulating sequence of moves. Based on the number of turns, the present paper establishes two i...
متن کاملOn external contextual grammars with subregular selection languages
In this paper, we study the power of external contextual grammars with selection languages from subfamilies of the family of regular languages. If we consider families Fn which are obtained by restriction to n states or nonterminals or productions or symbols to accept or to generate regular languages, we obtain four infinite hierarchies of the corresponding families of languages generated by ex...
متن کاملA Representation of Trees by Languages I
A tree can be represented by a language consisting of a suitable coding of its finite branches. We investigate this representation and derive a number of reductions between certain equivalence problems for context-free tree grammars ~nd recursive program schemes and the (open) equivalence problem for DPDA's. This is the first ~zrt of th~s work: it is devoted to technical results on prefix-free ...
متن کاملAlternating Regular Tree Grammars in the Framework of Lattice-Valued Logic
In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued) regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Kybernetika
دوره 14 شماره
صفحات -
تاریخ انتشار 1978